Asymptotics for infinite server queues with fast/slow Markov switching and fat tailed service times

نویسندگان

چکیده

We study a general k dimensional infinite server queues process with Markov switching, Poisson arrivals and where the service times are fat tailed index α∈(0,1). When arrival rate is sped up by factor nγ, transition probabilities of underlying chain divided nγ n, we identify two regimes (”fast arrivals”, when γ>α, and” equilibrium”, γ=α) in which prove that properly rescaled converges pointwise distribution to some limiting process. In third” slow arrivals” regime, γ<α, show convergence first joint moments

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Markov-modulated infinite-server queues with general service times

This paper studies an infinite-server queue in a Markov environment, that is, an infiniteserver queue with an arrival rate that equals λi when an external Markov process is in state i. The service times have a general distribution that depends on the state of the background process upon arrival. We start by setting up explicit formulas for the mean and variance of the number of particles in the...

متن کامل

Infinite-server Queues with Batch Arrivals and Dependent Service Times

Motivated by large-scale service systems, we consider an infinite-server queue with batch arrivals, where the service times are dependent within each batch. We allow the arrival rate of batches to be time-varying as well as constant. As regularity conditions, we require that the batch sizes be i.i.d. and independent of the arrival process of batches, and we require that the service times within...

متن کامل

Two-parameter heavy-traffic limits for infinite-server queues with dependent service times

This paper is a sequel to our 2010 paper in this journal in which we established heavy-traffic limits for two-parameter processes in infinite-server queues with an arrival process that satisfies an FCLT and i.i.d. service times with a general distribution. The arrival process can have a time-varying arrival rate. In particular, an FWLLN and an FCLT were established for the two-parameter process...

متن کامل

Time-scaling Limits for Markov-modulated Infinite-server Queues

In this paper we study semi-Markov modulated M/M/∞ queues, which are to be understood as infinite-server systems in which the Poisson input rate is modulated by a Markovian background process (where the times spent in each of its states are assumed deterministic), and the service times are exponential. Two specific scalings are considered, both in terms of transient and steady-state behavior. I...

متن کامل

A Central Limit Theorem for Markov-Modulated Infinite-Server Queues

This paper studies an infinite-server queue in a Markov environment, that is, an infinite-server queue with arrival rates and service times depending on the state of a Markovian background process. Scaling the arrival rates λi by a factor N and the rate qij of the background process by a factor N, with α ∈ R, we establish a central limit theorem as N tends to ∞. We find different scaling regime...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Stochastic Models

سال: 2021

ISSN: ['1532-4214', '1532-6349']

DOI: https://doi.org/10.1080/15326349.2021.1950014